Intersection of unit balls in classical matrix ensembles
نویسندگان
چکیده
منابع مشابه
Intersection of Unit-balls and Diameter of a Point Set in 3
We describe an algorithm for computing the intersection of n balls of equal radius in IR 3 which runs in time O(n lg 2 n). The algorithm can be parallelized so that the comparisons that involve the radius of the balls are performed in O(lg 3 n) batches. Using parametric search, these algorithms are used to obtain an algorithm for computing the diameter of a set of n points in IR 3 (the maximum ...
متن کاملTouching Graphs of Unit Balls
The touching graph of balls is a graph that admits a representation by non-intersecting balls in the space (of prescribed dimension), so that its edges correspond to touching pairs of balls. By a classical result of Koebe [?], the disc touching graphs are exactly the planar graphs. This paper deals with a recognition of unit-ball touching graphs. The 2– dimensional case was proved to be NP-hard...
متن کاملBest approximation by closed unit balls
We obtain a sucint and nesessery theoreoms simple for compactness andweakly compactness of the best approximate sets by closed unit balls. Also weconsider relations Kadec-Klee property and shur property with this objects.These theorems are extend of papers mohebi and Narayana.
متن کاملVolume of intersection of two balls in orientation space.
Orientations deviating from an ideal orientation by angles not exceeding a given limit constitute a ball in the metric space of orientations. Such balls arise in crystallographic computations, and in some cases intersections of the balls are of interest. This paper provides an analytical formula for calculation of the volume of the intersection of two balls from their radii and the distance bet...
متن کاملIntersection Graphs for Families of Balls in Rn
1. INTRODUCTION If F is a finite family of sets, then the intersection graph r(F) is the graph with vertex-set F and edges the unordered pairs C, D of distinct elements of F such that C n D # 0. It is easy to see [6, p. 19] that every graph G is isomorphic to some intersection graph T(F). Some interesting classes of graphs have arisen by letting F range over families of balls in some metric spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2020
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-020-2052-6